Queueing Models Involving Buffers.

A Survey of Closed Queueing Networks with Finite Buffers

Equivalencies Between Open and Closed Queueing Networks with Finite Buffers

A Queueing Model for Wormhole Routing with Finite Buffers

Analytical models for wormhole routing in hypercube have widely been reported in the literature. Most of these models, however, have assumed negligible input buffer sizes. Hu and Kleinrock in [8] have proposed an analytical model that captures the effect of finite input buffer size for irregular high-speed LANs while Kouvatsos, Assi, and Ould-Khaoua [11] have very recently proposed a model base...

Single Server Queueing Models

This technical support center is vital to Macrohard’s business strategy, since it has a significant impact on customers’ experience with their products. To ensure that this experience is positive, technicians must provide accurate information and helpful support. From Macrohard’s perspective, this is a matter of ensuring that the technician has the right skill and training. But for customers to...

Group strategyproofness in queueing models

We examine the tradeoffs between two variants of group strategyproofness, efficiency and budget balance in queueing models. In general, group strategyproofness is incompatible with efficiency and budget balance. Weakening budget balance to feasibility, we show that the incompatibility persists with strong group strategyproofness. We then identify a necessary condition for weak group strategypro...